SUPER RSK-ALGORITHMS AND SUPER PLACTIC MONOID

Super Rsk - Algorithms and Super

We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants and Young-Pieri rule. A generalization of the symmetry theorem in the signed case is also obtained. Except for this last result, all the other results are pro...

Parastatistics Algebra, Young Tableaux and the Super Plactic Monoid

The parastatistics algebra is a superalgebra with (even) parafermi and (odd) parabose creation and annihilation operators. The states in the parastatistics Fock-like space are shown to be in one-to-one correspondence with the Super Semistandard Young Tableaux (SSYT) subject to further constraints. The deformation of the parastatistics algebra gives rise to a monoidal structure on the SSYT which...

The Shifted Plactic Monoid

We introduce a shifted analog of the plactic monoid of Lascoux and Schützenberger, the shifted plactic monoid. It can be defined in two different ways: via the shifted Knuth relations, or using Haiman’s mixed insertion. Applications include: a new combinatorial derivation (and a new version of) the shifted Littlewood-Richardson Rule; similar results for the coefficients in the Schur expansion o...

The Plactic Monoid

The shifted plactic monoid ( extended abstract )

The (shifted) plactic monoid. The celebrated Robinson-Schensted-Knuth correspondence (14) is a bijection between words in a linearly ordered alphabet X = {1 < 2 < 3 < · · · } and pairs of Young tableaux with entries in X . More precisely, each word corresponds to a pair consisting of a semistandard insertion tableau and a standard recording tableau. The words producing a given insertion tableau...